Primitive Recursion and Isaacson's Thesis
نویسندگان
چکیده
منابع مشابه
Stratified polymorphism and primitive recursion
Natural restrictions on the syntax of the second order (i.e. polymorphic) lambda calculus are of interest for programming language theory. In [Leivant, 1991] one of the authors showed that when type abstraction in that calculus is stratified into levels, the definable numeric functions are precisely the super-elementary functions (level E4 in the Grzegorczyk Hierarchy). We define here a second ...
متن کاملPrimitive Recursion and State Machines
Methods for specifying Moore type state machines (transducers) abstractly via primitive recursive functions and for definining parallel composition via simultaneous primitive recursion are discussed. The method is mostly of interest as a concise and convenient way of working with the complex state systems found in computer programming and engineering, but a short section indicates connections t...
متن کاملPrimitive recursion in niteness spaces
We study iteration and recursion operators in the multiset relational model of linear logic and prove them nitary in the sense of the niteness spaces recently introduced by Ehrhard. This provides a denotational semantics of Gödel's system T and paves the way for a systematic study of a large class of algorithms, following the ideas of Girard's quantitative semantics in a standard algebraic sett...
متن کاملPrimitive Recursion and the Chain Antichain Principle
Let the chain antichain principle (CAC) be the statement that each partial order on N possesses an infinite chain or an infinite antichain. Chong, Slaman and Yang recently proved using forcing over non-standard models of arithmetic that CAC is Π1-conservative over RCA0 + Π 0 1-CP and so in particular that CAC does not imply Σ2-induction. We provide here a different purely syntactical and constr...
متن کاملPrimitive Recursion for Higher-Order Abstract Syntax
Higher-order abstract syntax is a central representation technique in logical frameworks which maps variables of the object language into variables in the meta-language. It leads to concise encodings, but is incompatible with functions defined by primitive recursion or proofs by induction. In this paper we propose an extension of the simply-typed lambda-calculus with iteration and case construc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Thought: A Journal of Philosophy
سال: 2018
ISSN: 2161-2234
DOI: 10.1002/tht3.399